Process algebra and conditional composition
نویسندگان
چکیده
We discern three non-classical truth values, and define a five-valued propositional logic. We combine this logic with process algebra via conditional composition (i.e., if-then-else-). In particular, the choice operation (+) is regarded as a special case of conditional composition. We present an operational semantics in SOS-style and some completeness results. 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
Some algebraic properties of Lambert Multipliers on $L^2$ spaces
In this paper, we determine the structure of the space of multipliers of the range of a composition operator $C_varphi$ that induces by the conditional expectation between two $L^p(Sigma)$ spaces.
متن کاملSome notes on L-projections on Fourier-Stieltjes algebras
In this paper, we investigate the relation between L-projections and conditional expectations on subalgebras of the Fourier Stieltjes algebra B(G), and we will show that compactness of G plays an important role in this relation.
متن کاملAlgebra of Normal Function Tables
In contrast to classical algebra and analysis the functions encountered in computer science are usually piecewise continuous functions or functions whose evaluation rules change dramatically depending on a subset of the input values. Because of the pervasiveness of the if-then-else construction in programming, we have to extend classical mathematical methods to handle this kind of object. We ap...
متن کاملAlgebraic Matching of Vulnerabilities in a Low-Level Code
This paper explores the algebraic matching approach for detection of vulnerabilities in binary codes. The algebraic programming system is used for implementing this method. It is anticipated that models of vulnerabilities and programs to be verified are presented as behavior algebra and action language specifications. The methods of algebraic matching are based on rewriting rules and techniques...
متن کاملStrong Splitting Bisimulation Equivalence
We present ACP, a process algebra with conditional expressions in which the conditions are taken from a Boolean algebra, and extensions of this process algebra with mechanisms for condition evaluation. We confine ourselves to finitely branching processes. This restriction makes it possible to present ACP in a concise and intuitively clear way, and to bring the notion of splitting bisimulation e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 80 شماره
صفحات -
تاریخ انتشار 2001